Halving for the 2-Sylow subgroup of genus 2 curves over binary fields
نویسندگان
چکیده
Article history: Received 12 December 2007 Available online 16 June 2009 Communicated by James W. P. Hirschfeld
منابع مشابه
Efficient halving for genus 3 curves over binary fields
In this article, we deal with fast arithmetic in the Picard group of hyperelliptic curves of genus 3 over binary fields. We investigate both the optimal performance curves, where h(x) = 1, and the more general curves where the degree of h(x) is 1, 2 or 3. For the optimal performance curves, we provide explicit halving and doubling formulas; not only for the most frequent case but also for all p...
متن کاملEfficient Divisor Class Halving on Genus Two Curves
Efficient halving of divisor classes offers the possibility to improve scalar multiplication on hyperelliptic curves and is also a step towards giving hyperelliptic curve cryptosystems all the features that elliptic curve systems have. We present a halving algorithm for divisor classes of genus 2 curves over finite fields of characteristic 2. We derive explicit halving formulae from a doubling ...
متن کاملFaster Halvings in Genus 2
We study divisor class halving for hyperelliptic curves of genus 2 over binary fields. We present explicit halving formulas for the most interesting curves (from a cryptographic perspective), as well as all other curves whose group order is not divisible by 4. Each type of curve is characterized by the degree and factorization form of the polynomial h(x) in the curve equation. For each of these...
متن کاملClass Groups of Quadratic Fields
The author has computed the class groups of all complex quadratic number fields Q(\f^~D) °f discriminant D for 0 < D < 4000000. In so doing, it was found that the first occurrences of rank three in the 3-Sylow subgroup are D = 3321607 = prime, class group C(3) x C(3) x C(9.7) (C(n) a cyclic group of order n), and D = 3640387 = 421.8647, class group C(3) X C(3) X C(9.2). The author has also foun...
متن کاملDetermining the 2-Sylow subgroup of an elliptic curve over a finite field
In this paper we describe an algorithm that outputs the order and the structure, including generators, of the 2-Sylow subgroup of an elliptic curve over a finite field. To do this, we do not assume any knowledge of the group order. The results that lead to the design of this algorithm are of inductive type. Then a right choice of points allows us to reach the end within a linear number of succe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 15 شماره
صفحات -
تاریخ انتشار 2009